Enumerating sets with restrictions
نویسندگان
چکیده
منابع مشابه
Enumerating Order Types for Small Point Sets with Applications
Oswin Aichholzer Institute for Theoretical Computer Science Graz University of Technology Inffeldgasse 16b, A-8010 Graz, Austria [email protected] Franz Aurenhammer Institute for Theoretical Computer Science Graz University of Technology Inffeldgasse 16b, A-8010 Graz, Austria [email protected] Hannes Krasser Institute for Theoretical Computer Science Graz University of Technology In...
متن کاملEnumerating solution-free sets in the integers
Given a linear equation L, a set A ⊆ [n] is L-free if A does not contain any ‘non-trivial’ solutions to L. In this paper we consider the following three general questions: (i) What is the size of the largest L-free subset of [n]? (ii) How many L-free subsets of [n] are there? (iii) How many maximal L-free subsets of [n] are there? We completely resolve (i) in the case when L is the equation px ...
متن کاملCounting and Enumerating Independent Sets with Applications to Knapsack Problems
We introduce methods to count and enumerate all maximal independent, all maximum independent sets, and all independent sets in threshold graphs and k-threshold graphs. Within threshold graphs and k-threshold graphs independent sets correspond to feasible solutions in related knapsack instances. We give several characterizations for knapsack instances and multidimensional knapsack instances whic...
متن کاملKolmogorov complexity of enumerating finite sets
Solovay [5] has proved that the minimal length of a program enumerating a set A is upper bounded by 3 times the negative logarithm of the probability that a random program will enumerate A. It is unknown whether one can replace the constant 3 by a smaller constant. In this paper, we show that the constant 3 can be replaced by the constant 2 for finite sets A. We recall first two complexity meas...
متن کاملGenerating and Enumerating Digitally Convex Sets of Trees
Suppose V is a finite set and C a collection of subsets of V that contains ∅ and V and is closed under taking intersections. Then C is called a convexity and the ordered pair (V, C) is called an aligned space and the elements of C are referred to as convex sets. For a set S ⊆ V , the convex hull of S relative to C, denoted by CHC(S), is the smallest convex set containing S. A set S of vertices ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory
سال: 1969
ISSN: 0021-9800
DOI: 10.1016/s0021-9800(69)80055-4